Monadic Simultaneous Rigid E-Unification and Related Problems
نویسندگان
چکیده
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem. 1 Section
منابع مشابه
Decidable and Undecidable Second-Order Unification Problems
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-order unification. Word unification can be easily decided by transformation rules (similar to the ones applied in higher-order unification procedures) when variables are restricted to occur at most twice. Hence a well-kno...
متن کاملMonadic Simultaneous Rigid E-Uni cation and Related Problems
We study the monadic case of a decision problem know as simultaneous rigid E-uni cation. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.
متن کاملBernhard Beckert Rigid E - Unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملRigid E-unification
By replacing syntactical unification with rigid E-unification, equality handling can be added to rigid variable calculi for first-order logic, including free variable tableau (Fitting, 1996), the mating method (Andrews, 1981), the connection method (Bibel, 1982), and model elimination (Loveland, 1969); for an overview of these calculi, see Chapters I.1.1 and I.1.2. Rigid E-unification and its s...
متن کاملRigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of a new rather restricted kind of second-order unification. We also show that certain decidable subclasses of the problem which are P-complete in the equational case become EXPTIME-complete when symmetry is absent. By a...
متن کامل